Increasing Fixed-Priority Schedulability using Non-Periodic Load Shapers

نویسندگان

  • Mitra Nasri
  • Geoffrey Nelissen
چکیده

Many real-time systems use fixed-priority scheduling (FPS) for three main reasons: (i) it is easy to understand, configure and analyse, (ii) it has low runtime overheads, and (iii) it is widely implemented in commercial operating systems. Additionally, FPS is enforced by some industrial safety related standards such as Autosar. However, FPS is not optimal from a schedulability viewpoint as it may prioritise the execution of non-urgent high-priority tasks over tasks with urgent deadlines. As an attempt to increase FPS schedulability, variations of the FPS scheduling scheme such as Preemption Threshold Scheduling (PTS) [1] and Dual-Priroity (DP) scheduling [2] have been introduced. PTS raises the priority of a task (possibly several times) based on its remaining execution time, while DP promotes the task’s priority after a given time following its release. It was shown that PTS is not optimal [3] and designing a strategy for correctly assigning priorities and promotion times such that all deadlines are met is still an open problem for DP [4]. In this work, we introduce load-shaping (LS); a technique that shapes the workload of tasks to limit their impact on the system’s schedulability while improving the system’s safety. LS is implemented using a reservation server for each task. Each server has a budget that replenishes itself following a given pattern.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed priority scheduling periodic tasks with varying execution priority

This paper considers the problem of fixed priority scheduling of periodic tasks where each task’s execution priority may vary. Periodic tasks are decomposed into serially executed subtasks. where each subtask is characterized by an execution time and a fixed priority, and is permitted to have a deadline. A method for determining the schedulability of each task is presented along with its theore...

متن کامل

A Generic Approach to Schedulability Analysis of Real-Time Tasks

In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with fixed rates. To relax the assumption of complete knowledge on arrival times, we propose to use timed automata to describe task arrival patterns. In a recent work, it is shown that for fixed priority scheduling strategy and tasks with only timing constraints (i.e. executi...

متن کامل

Efficient Algorithms for Schedulability Analysis and Priority Assignment of Fixed-Offset Periodic Tasksets

Fixed-priority scheduling is the most common scheduling algorithm used in industry practice. Imposing fixed task release offsets is an effective technique for improving schedulability by avoiding the critical instant when all tasks are released simultaneously. In this paper, we address the problem of schedulability analysis and priority assignment for a periodic taskset with fixed-priority pree...

متن کامل

Near-Optimal Bandwidth Allocation for Fixed-Priority Scheduled Arbitrary-Deadline Sporadic Tasks upon Periodic Resources∗

Schedulability for compositional real-time systems has been the focus of a great deal of recent research. In this problem domain, we consider the fixed-priority (FP) scheduling of arbitrary-deadline sporadic task systems upon periodic resources. Existing exact or approximate schedulability tests for dedicated uniprocessor scheduling can be used in this setting by modeling the “no-supply period”...

متن کامل

Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling

In this paper, we investigate the quality of several linear-time schedulability tests for preemptive and non-preemptive fixed-priority scheduling of uniprocessor systems. The metric used to assess the quality of these tests is the resource augmentation bound commonly known as the processor speedup factor. The speedup factor of a schedulability test corresponds to the smallest factor by which th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017